/*
 * @lc app=leetcode.cn id=1000 lang=cpp
 *
 * [1000] 合并石头的最低成本
 */
#include "include.h"
// @lc code=start
class Solution {
public:
    int mergeStones(vector<int>& stones, int k) {
        if ((stones.size()-k)%(k-1) != 0){return -1;}
        
        // how to get min ?
        return 1;
    }
};
// @lc code=end

